Reprint of: Refold rigidity of convex polyhedra
نویسندگان
چکیده
منابع مشابه
Refold rigidity of convex polyhedra
We show that every convex polyhedron may be unfolded to one planar piece, and then refolded to a different convex polyhedron. If the unfolding is restricted to cut only edges of the polyhedron, we identify several polyhedra that are “edge-unfold rigid” in the sense that each of their unfoldings may only fold back to the original. For example, each of the 43,380 edge unfoldings of a dodecahedron...
متن کاملA Rigidity Criterion for Non-Convex Polyhedra
Let P be a (non necessarily convex) embedded polyhedron in R, with its vertices on an ellipsoid. Suppose that the interior of P can be decomposed into convex polytopes without adding any vertex. Then P is infinitesimally rigid. More generally, let P be a polyhedron bounding a domain which is the union of polytopes C1, · · · , Cn with disjoint interiors, whose vertices are the vertices of P . Su...
متن کاملOn the infinitesimal rigidity of weakly convex polyhedra
The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex polyhedron, is infinitesimally rigid. We prove that it is indeed the case for two classes of polyhedra: those obtained from a convex polyhedron by “denting” at most two edges at a common vertex, and suspensions with a natu...
متن کاملCauchy Rigidity of C -polyhedra
We generalize Cauchy’s celebrated theorem on the global rigidity of convex polyhedra in Euclidean 3-space E to the context of circle polyhedra in the 2-sphere S. We prove that any two convex and bounded non-unitary c-polyhedra with Möbiuscongruent faces that are consistently oriented are Möbius-congruent. Our result implies the global rigidity of convex inversive distance circle packings as wel...
متن کاملOn the Infinitesimal Rigidity of Polyhedra with Vertices in Convex Position
Let P ⊂ R3 be a polyhedron. It was conjectured that if P is weakly convex (i. e. its vertices lie on the boundary of a strictly convex domain) and decomposable (i. e. P can be triangulated without adding new vertices), then it is infinitesimally rigid. We prove this conjecture under a weak additionnal assumption of codecomposability. The proof relies on a result of independent interest concerni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2014
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2013.11.001